Searching with known error probability

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some New Properties of the Searching Probability

Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...

متن کامل

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

some new properties of the searching probability

consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. in the noisy case, search probability is given by shirakura et al. (ann. statist. 24(6) (1996) 2560). in this paper some new properties of the searching probability are presented. new properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...

متن کامل

Searching with lies under error cost constraints

The Rényi-Berlekamp-Ulam game is a classical model for the problem of determining the minimum number of queries to find an unknown member in a finite set when up to a finite number of the answers may be erroneous. In the variant considered in this paper, questions with q many possible answers are allowed, further lies are constrained by a bipartite graph with edges weighted by 0, 1, 2, . . . (t...

متن کامل

Searching for gravitational waves from known pulsars

We present upper limits on the amplitude of gravitational waves from 28 isolated pulsars using data from the second science run of LIGO. The results are also expressed as a constraint on the pulsars’ equatorial ellipticities. We discuss a new way of presenting such ellipticity upper limits that takes account of the uncertainties of the pulsar moment of inertia. We also extend our previous metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1989

ISSN: 0304-3975

DOI: 10.1016/0304-3975(89)90077-7